Optimal Error Correcting Delivery Scheme for Coded Caching with Symmetric Batch Prefetching
نویسندگان
چکیده
Coded caching is used to reduce network congestion during peak hours. A single server is connected to a set of users through a bottleneck link, which generally is assumed to be errorfree. During non-peak hours, all the users have full access to the files and they fill their local cache with portions of the files available. During delivery phase, each user requests a file and the server delivers coded transmissions to meet the demands taking into consideration their cache contents. In this paper we assume that the shared link is error prone. A new delivery scheme is required to meet the demands of each user even after receiving finite number of transmissions in error. We characterize the minimum average rate and minimum peak rate for this problem. We find closed form expressions of these rates for a particular caching scheme namely symmetric batch prefetching. We also propose an optimal error correcting delivery scheme for coded caching problem with symmetric batch prefetching.
منابع مشابه
Optimal Error Correcting Delivery Scheme for an Optimal Coded Caching Scheme with Small Buffers
Optimal delivery scheme for coded caching problems with small buffer sizes and the number of users no less than the amount of files in the server was proposed by Chen, Fan and Letaief [“Fundamental limits of caching: improved bounds for users with small buffers," IET Communications, 2016]. This scheme is referred to as the CFL scheme. In this paper, the link between the server and the users is ...
متن کاملEfficient File Delivery for Coded Prefetching in Shared Cache Networks with Multiple Requests Per User
We consider a centralized caching network, where a server serves several groups of users, each having a common shared fixed-size cache and requesting multiple files. An existing coded prefetching scheme is employed where each file is broken into multiple fragments and each cache stores multiple coded packets each formed by XORing fragments from different files. For such a system, we propose an ...
متن کاملCoded Caching with Heterogeneous Cache Sizes and Link Qualities: The Two-User Case
The centralized coded caching problem is studied under heterogeneous cache sizes and channel qualities from the server to the users, focusing on the two-user case. More specifically, a server holding N files is considered to be serving two users with different cache sizes, each requesting a single file, and it is assumed that in addition to the shared common link, each user also has a private l...
متن کاملFundamental Limits of Caching: Improved Bounds with Coded Prefetching
We consider a cache network in which a single server is connected to multiple users via a shared error free link. The server has access to a database with N files of equal length F , and serves K users each with a cache memory of MF bits. A novel centralized coded caching scheme is proposed for scenarios with more users than files N ≤ K and cache capacities satisfying 1 K ≤ M ≤ N K . The propos...
متن کاملA Statistical, Batch, Proxy-Side Web Prefetching Scheme for Efficient Internet Bandwidth Usage
As the number of World Wide Web (Web) users grows, Web traffic continues to increase at an exponential rate and has become one of the major components of Internet traffic. One of the solutions to reduce Web traffic and speed up Web access is Web caching. However, standard Web caching has limitations in reflecting usage patterns that change on a daily basis, with fluctuating peak and off-peak pe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1712.08113 شماره
صفحات -
تاریخ انتشار 2017